Fanica Gavril: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

Gavril, Fănică

Journal:

SIAM Journal on Computing

Year:

1972

Language:

english

File:

PDF, 813 KB

english, 1972

2

A synthesis of methods for simulating vulnerability of armored vehicles

Fǎnicǎ Gavril

Journal:

Naval Research Logistics (NRL)

Year:

1995

Language:

english

File:

PDF, 1.27 MB

english, 1995

3

An algorithm for constructing edge-trees from hypergraphs

Fǎnicǎ Gavril, Robert Tamari

Journal:

Year:

1983

Language:

english

File:

PDF, 628 KB

english, 1983

4

Intersection graphs of k-acyclic families of subtrees and relational database query processing

Fǎnicǎ Gavril, Oded Shmueli

Journal:

Information Processing Letters

Year:

1998

Language:

english

File:

PDF, 636 KB

english, 1998

5

The maximum k-colorable subgraph problem for chordal graphs

Mihalis Yannakakis, Fanica Gavril

Journal:

Information Processing Letters

Year:

1987

Language:

english

File:

PDF, 390 KB

english, 1987

6

Algorithms for maximum k-colorings and k-coverings of transitive graphs

Fǎnicǎ Gavril

Journal:

Year:

1987

Language:

english

File:

PDF, 356 KB

english, 1987

7

Algorithms on clique separable graphs

Fǎnicǎ Gavril

Journal:

Discrete Mathematics

Year:

1977

Language:

english

File:

PDF, 925 KB

english, 1977

8

A recognition algorithm for the intersection graphs of paths in trees

Fănică Gavril

Journal:

Discrete Mathematics

Year:

1978

Language:

english

File:

PDF, 3.91 MB

english, 1978

9

An efficiently solvable graph partition problem to which many problems are reducible

Fănică Gavril

Journal:

Information Processing Letters

Year:

1993

Language:

english

File:

PDF, 544 KB

english, 1993

10

Characterization and algorithms of curve map graphs

Fǎnicǎ Gavril, Johanan Schönheim

Journal:

Discrete Applied Mathematics

Year:

1982

Language:

english

File:

PDF, 685 KB

english, 1982

11

Intersection graphs of Helly families of subtrees

Fǎnicǎ Gavril

Journal:

Discrete Applied Mathematics

Year:

1996

Language:

english

File:

PDF, 964 KB

english, 1996

12

Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs

Fanica Gavril, Johanan Schönheim

Journal:

Journal of Algorithms

Year:

1985

Language:

english

File:

PDF, 721 KB

english, 1985

13

Generating the maximum spanning trees of a weighted graph

Fǎnicǎ Gavril

Journal:

Journal of Algorithms

Year:

1987

Language:

english

File:

PDF, 395 KB

english, 1987

14

Minimum weight feedback vertex sets in circle graphs

Journal:

Information Processing Letters

Year:

2008

Language:

english

File:

PDF, 153 KB

english, 2008

15

Intersection representations of matrices by subtrees and unicycles on graphs

Fanica Gavril, Ron Y. Pinter, Shmuel Zaks

Journal:

Journal of Discrete Algorithms

Year:

2008

Language:

english

File:

PDF, 230 KB

english, 2008

16

Maximum weight independent sets and cliques in intersection graphs of filaments

Journal:

Information Processing Letters

Year:

2000

Language:

english

File:

PDF, 115 KB

english, 2000

17

Algorithms for maximum weight induced paths

Journal:

Information Processing Letters

Year:

2002

Language:

english

File:

PDF, 91 KB

english, 2002

18

A recognition algorithm for the intersection graphs of directed paths in directed trees

Fǎnicǎ Gavril

Journal:

Discrete Mathematics

Year:

1975

Language:

english

File:

PDF, 1.31 MB

english, 1975

19

The intersection graphs of subtrees in trees are exactly the chordal graphs

Fǎnicǎ Gavril

Journal:

Journal of Combinatorial Theory, Series B

Year:

1974

Language:

english

File:

PDF, 523 KB

english, 1974

20

-interval-filament graphs

Journal:

Discrete Applied Mathematics

Year:

2007

Language:

english

File:

PDF, 226 KB

english, 2007

21

Algorithms for induced biclique optimization problems

Journal:

Information Processing Letters

Year:

2011

Language:

english

File:

PDF, 147 KB

english, 2011

22

Testing for equality between maximum matching and minimum node covering

Fǎnicǎ Gavril

Journal:

Information Processing Letters

Year:

1977

Language:

english

File:

PDF, 451 KB

english, 1977

23

MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS

Journal:

Discrete Mathematics Algorithms and Applications

Year:

2011

Language:

english

File:

PDF, 215 KB

english, 2011

24

ALGORITHMS ON SUBGRAPH OVERLAP GRAPHS

Journal:

Discrete Mathematics Algorithms and Applications

Year:

2014

Language:

english

File:

PDF, 218 KB

english, 2014

25

Merging with parallel processors

Gavril, Fănică

Journal:

Communications of the ACM

Year:

1975

Language:

english

File:

PDF, 398 KB

english, 1975

26

Algorithms for GA-H reduced graphs

Journal:

Journal of Discrete Algorithms

Year:

2015

Language:

english

File:

PDF, 382 KB

english, 2015

27

Intersection graphs of proper subtrees of unicyclic graphs

Gavril, Fǎnicǎ

Journal:

Journal of Graph Theory

Year:

1994

Language:

english

File:

PDF, 1.14 MB

english, 1994

28

Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs

Journal:

Discrete Mathematics Algorithms and Applications

Year:

2015

Language:

english

File:

PDF, 478 KB

english, 2015

29

[Annals of Discrete Mathematics] Quo Vadis, Graph Theory? - A Source Book for Challenges and Directions Volume 55 || Numerical Decks of Trees

Year:

1993

Language:

english

File:

PDF, 756 KB

english, 1993

30

New insights on GA-H reduced graphs

Journal:

Information Processing Letters

Year:

2017

Language:

english

File:

PDF, 244 KB

english, 2017